When Can We Answer Queries Using Result-Bounded Data Interfaces?

We consider answering queries on data available through access methods, that provide lookup to the tuples matching a given binding. Such interfaces are common Web; further, they often have bounds how many results can return, e.g., because of pagination or rate limits. thus study result-bounded which may return only limited number tuples. decide if query is answerable using i.e., compute plan returns all answers assuming underlying satisfies some integrity constraints. first show reduce answerability containment problem with Second, we "schema simplification" theorems describing when and services be used. Finally, use these give decidability complexity about for constraint classes.